#include"tree.h"
#include"Queue.h"


int main()
{
	char a[] = { "ABD##E#H##CF##G##" };
	int i = 0;
	BTNode*root=BinaryTreeCreate(a, &i);
	printf("TreeSize:%d\n", BinaryTreeSize(root));

	printf("TreeLeefSize:%d\n", BinaryTreeLeefSize(root));

	printf("TreeLevel3Size:%d\n", BinaryTreeLevelKSize(root, 3));

	printf("TreeLevel2Size:%d\n", BinaryTreeLevelKSize(root, 2));

	printf("TreeFind:%c\n", (BinaryTreeFind(root, 'F'))->data);

	BinaryTreePreOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");

	printf("isTreeComplete:%d", BinaryTreeComplete(root));

	BinaryTreeDestory(&root);
	return 0;
}